Resource constrained routing and scheduling: Review and research prospects

In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling. The latter unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects.